perm filename MATHEM.1[LET,JMC] blob
sn#544092 filedate 1980-11-05 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 .require "let.pub[let,jmc]" source
C00004 ENDMK
C⊗;
.require "let.pub[let,jmc]" source;
∂AIL %2Mathematics Magazine%1↓Moravian College↓Bethlehem, PA 18018∞
To the Editor:
Oren Patashnik's interesting "Qubic: 4qx4qx4 Tic-Tac-Toe"
considers his solution adequately verified by the fact that
Ken Thompson wrote another computer program getting the same
result. Mathematics can do better than that.
Computer programs are mathematical objects, and their
properties are subject to mathemtical proof. It would have been
Patashnik should undertake to prove that if his program accepts
a collection of moves as determining a win for the first player,
then a win really exists. Such a proof might be rather long but
is entirely feasible.
.sgn